Bipartite graph

Results: 300



#Item
21Like a Pack of Wolves: Community Structure of Web Trackers Vasiliki Kalavri1 , Jeremy Blackburn2 , Matteo Varvello2 , and Konstantina Papagiannaki2 1

Like a Pack of Wolves: Community Structure of Web Trackers Vasiliki Kalavri1 , Jeremy Blackburn2 , Matteo Varvello2 , and Konstantina Papagiannaki2 1

Add to Reading List

Source URL: www.tid.es

Language: English - Date: 2016-02-24 03:37:11
22On the Complexity of Paths Avoiding Forbidden Pairs Petr Kolman, Ondˇrej Pangr´ac Department of Applied Mathematics and Institute for Theoretical Computer Science, Charles University, Malostransk´e n´

On the Complexity of Paths Avoiding Forbidden Pairs Petr Kolman, Ondˇrej Pangr´ac Department of Applied Mathematics and Institute for Theoretical Computer Science, Charles University, Malostransk´e n´

Add to Reading List

Source URL: kam.mff.cuni.cz

Language: English - Date: 2009-04-29 03:46:21
23Natural Computing manuscript No. (will be inserted by the editor) Classical, quantum and non-signalling resources in bipartite games Gilles Brassard 1 , Anne Broadbent 1 , Esther H¨anggi 2 , Andr´e Allan M´ethot 3 ,

Natural Computing manuscript No. (will be inserted by the editor) Classical, quantum and non-signalling resources in bipartite games Gilles Brassard 1 , Anne Broadbent 1 , Esther H¨anggi 2 , Andr´e Allan M´ethot 3 ,

Add to Reading List

Source URL: cqi.inf.usi.ch

Language: English - Date: 2012-11-05 03:42:47
24New Results on Maximum Induced Matchings in Bipartite Graphs and Beyond Konrad K. Dabrowskia,b , Marc Demangec,d , Vadim V. Lozina a DIMAP b School

New Results on Maximum Induced Matchings in Bipartite Graphs and Beyond Konrad K. Dabrowskia,b , Marc Demangec,d , Vadim V. Lozina a DIMAP b School

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2013-03-14 00:55:15
25Network structural equivalence and the reversal of the Southern Vowel Shift Robin Dodsworth, North Carolina State University, Richard Benton, University of Illinois One kind of evidence for the i

Network structural equivalence and the reversal of the Southern Vowel Shift Robin Dodsworth, North Carolina State University, Richard Benton, University of Illinois One kind of evidence for the i

Add to Reading List

Source URL: labphon.org

Language: English - Date: 2016-04-12 14:05:01
26Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014

Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014

Add to Reading List

Source URL: resources.mpi-inf.mpg.de

Language: English - Date: 2014-07-03 07:48:38
27An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs George B. Mertzios and Walter Unger Department of Computer Science RWTH Aachen, Germany {mertzios, quax}@cs.rwth-aachen.de

An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs George B. Mertzios and Walter Unger Department of Computer Science RWTH Aachen, Germany {mertzios, quax}@cs.rwth-aachen.de

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2008-11-30 14:19:38
28Chaplick, Steven Curriculum Vitae June 2016 Address: Lehrstuhl für Informatik I, Universität Würzburg, Am Hubland, DWürzburg, Germany.

Chaplick, Steven Curriculum Vitae June 2016 Address: Lehrstuhl für Informatik I, Universität Würzburg, Am Hubland, DWürzburg, Germany.

Add to Reading List

Source URL: www1.informatik.uni-wuerzburg.de

Language: English - Date: 2016-06-04 11:41:50
29SIAM J. DISCRETE MATH. Vol. 29, No. 2, pp. 835–853 c 2015 Society for Industrial and Applied Mathematics 

SIAM J. DISCRETE MATH. Vol. 29, No. 2, pp. 835–853 c 2015 Society for Industrial and Applied Mathematics 

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2015-04-28 08:29:58
30PATHS, TREES, AND FLOWERS JACK E D M O N D S 1. Introduction. A graph G for purposes here is a finite set of elements called vertices and a finite set of elements called edges such that each edge meets exactly two vertic

PATHS, TREES, AND FLOWERS JACK E D M O N D S 1. Introduction. A graph G for purposes here is a finite set of elements called vertices and a finite set of elements called edges such that each edge meets exactly two vertic

Add to Reading List

Source URL: www.cs.mun.ca

Language: English - Date: 2015-03-23 10:06:06